Pumping lemmas for weighted automata
نویسندگان
چکیده
We present pumping lemmas for five classes of functions definable by fragments weighted automata over the min-plus semiring, max-plus semiring and natural numbers. As a corollary we show that hierarchy unambiguous, finitely-ambiguous, polynomially-ambiguous automata, full class is strict semirings.
منابع مشابه
Pumping lemmas for linear and nonlinear context-free languages
Pumping lemmas are created to prove that given languages are not belong to certain language classes. There are several known pumping lemmas for the whole class and some special classes of the context-free languages. In this paper we prove new, interesting pumping lemmas for special linear and context-free language classes. Some of them can be used to pump regular languages in two place simultan...
متن کاملWeighted automata
Weighted automata are classical finite automata in which the transitions carry weights. 7 These weights may model quantitative properties like the amount of resources needed for executing 8 a transition or the probability or reliability of its successful execution. Using weighted automata, 9 we may also count the number of successful paths labeled by a given word. 10 As an introduction into thi...
متن کاملWeighted Automata and Weighted Logics
In automata theory, Büchi’s and Elgot’s fundamental theorems [6, 7, 25] established the coincidence of regular and ω-regular languages with languages definable in monadic second-order logic. At the same time, Schützenberger [57] investigated finite automata with weights and characterized their behaviours as rational formal power series. Both of these results have inspired a wealth of extensions...
متن کاملBisimulation Metrics for Weighted Automata
We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale’s linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral properties of sets of linear operators. In particular, the joint spectral radius of the transition matrices of WFA plays a central role. We also study continui...
متن کاملGeneralization Bounds for Weighted Automata
This paper studies the problem of learning weighted automata from a finite labeled training sample. We consider several general families of weighted automata defined in terms of three different measures: the norm of an automaton’s weights, the norm of the function computed by an automaton, or the norm of the corresponding Hankel matrix. We present new data-dependent generalization guarantees fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2021
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-17(3:7)2021